An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
نویسندگان
چکیده
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملImproved Absolute Approximation Ratios for Two-Dimensional Packing Problems
We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of minimal height, respectively. All packings have to be non-overlapping and orthogonal, i.e., axisparallel. Our algorithm for strip packing has an absolute approximation ratio of 1.9396 and is the first algorithm to break the ap...
متن کاملImproved Approximation for Vector Bin Packing
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set of d-dimensional vectors v1, . . . , vn in [0, 1] , and the goal is to pack them into the least number of bins so that for each bin B, the sum of the vectors in it is at most 1 in every dimension, i.e., || ∑ vi∈B vi||...
متن کاملA Linear Approximation Algorithm for 2-Dimensional Vector Packing
We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 corresponding capacities. The goal is to group items into minimum number of bins, without violating the bin capacity constraints. We propose an Θ(n)-time approximation algorithm that is inspired by the O(n) algorithm proposed...
متن کاملA Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
We present a new lemma stating that, given an arbitrary packing of a set of rectangles into a larger rectangle, a “structured” packing of nearly the same set of rectangles exists. This lemma has several implications on the approximability of 2-dimensional packing problems. In this paper, we use it to show the existence of a polynomial-time approximation scheme for 2-dimensional geometric knapsa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0903.2265 شماره
صفحات -
تاریخ انتشار 2009